Single-Machine Total Completion Time Scheduling with Position-Based Deterioration and Multiple Rate-Modifying Activities

Genetic algorithms for single machine scheduling with time-dependent deterioration and rate-modifying activities

In this paper, the integration of two emerging classes of scheduling problems, the class of scheduling problems with time-dependent deterioration and the class of scheduling problems with rate-modifying activities, are addressed. The scheduling problems have been studied independently. However, the integration of these classes is motivated by human operators of tasks who have fatigue while carr...

Identical parallel machine scheduling with nonlinear deterioration and multiple rate modifying activities

Article History: Received 05 January 2017 Accepted 23 February 2017 Available 15 July 2017 This study focuses on identical parallel machine scheduling of jobs with deteriorating processing times and rate-modifying activities. We consider nonlinearly increasing processing times of jobs based on their position assignment. Rate modifying activities (RMAs) are also considered to recover the increas...

Single machine scheduling with time-dependent linear deterioration and rate-modifying maintenance

We study single machine scheduling problems with linear time-dependent deterioration effects and maintenance activities. Maintenance periods (MPs) are included into the schedule, so that the machine, that gets worse during the processing, can be restored to a better state. We deal with a job-independent version of the deterioration effects, i.e., all jobs share a common deterioration rate. Howe...

Single Machine Problem with Multi-Rate-Modifying Activities under a Time-Dependent Deterioration

1 College of Information Science and Engineering, Northeastern University, and State Key Laboratory of Synthetical Automation for Process Industries (Northeastern University) Shenyang, Wenhua Road, Heping District, No. 11, Lane 3, Shenyang, Liaoning 110819, China 2Department of Management and Marketing, The Hong Kong Polytechnic University, Hong Kong 3 Department of Industrial and Systems Engin...

Two agents single machine scheduling problem with total completion time and total weighted completion time objectives